General Algorithm for Improved Lattice Actions on Parallel Computing Architectures

General Algorithm For Improved Lattice Actions on Parallel Computing Architectures

Quantum field theories underlie all of our understanding of the fundamental forces of nature. The only known first principles approach to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the strong interaction] away from the perturbative (i.e., weak-coupling) regime is the use of Monte Carlo methods on a hypercubic space-time lattice. These methods consume e...

Improved lattice actions

The idea to improve lattice actions [1,2] is nearly as old as the use of lattices in regularizing field theories [3]. Nevertheless, until recently numerical simulations were performed mostly with the simplest (standard) form of lattice actions. This attitude seems to have been altered — at this conference there were probably more contributions using some kind of improved action than the standar...

Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures

This paper introduces an architecture-independent, hierarchical approach to algorithm design on distributed-memory architectures, in contrast to the current trend of tailoring algorithms towards specific architectures. We show that, rather surprisingly, this new approach can achieve uniformity without sacrificing efficiency. In our framework, there are three levels of algorithm design: design o...

An Improved Image Segmentation Algorithm Based on GPU Parallel Computing

In the process of image segmentation, the classic Fuzzy C-Means (FCM) algorithm is time-consuming and depends heavily on initialization center. Based on Graphic Processing Unit (GPU), this paper proposes a novel FCM algorithm by improving the computational formulas of membership degree and the update criterion of cluster centers. Our algorithm can initialize cluster centers purposefully and fur...

Parallel Embedded Computing Architectures